Minimal Doubly Resolving Sets of Certain Families of Toeplitz Graph

نویسندگان

چکیده

The doubly resolving sets are a natural tool to identify where diffusion occurs in complicated network. Many real-world phenomena, such as rumour spreading on social networks, the spread of infectious diseases, and virus internet, may be modelled using information networks. It is obviously impractical monitor every node due cost overhead limits because there too many nodes network, some which unable or unwilling send about their state. As result, source localization problem find number network that best explains observed diffusion. This can successfully solved by its relationship with well-studied related minimal set problem, minimizes observers required for accurate detection. paper aims investigate certain families Toeplitz graph Tn(1, t), t ≥ 2 n + 2. We come conclusion 2), metric double dimensions equal 4), dimension exactly one more than dimension. Also, 3) = 5, 6, 7 greater 8.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

Minimal Doubly Resolving Sets and the Strong Metric Dimension of Hamming Graphs

The metric dimension problem, introduced independently by Slater [22] and Harary [8], has been widely investigated [1,3,5-7,9-13]. It arises in many diverse areas including network discovery and verification [2], geographical routing protocols [18], the robot navigation, connected joints in graphs, chemistry, etc. Given a simple connected undirected graph G = (VG,EG), where VG = {1, 2, ..., n},...

متن کامل

Minimal resolving sets for the hypercube

For a given undirected graph G, an ordered subset S = {s1, s2, . . . , sk} ⊆ V of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in S. While a superset of any resolving set is always a resolving set, a proper subset of a resolving set is not necessarily a resolving set, and we are interested in determining ...

متن کامل

Digital cohomology groups of certain minimal surfaces

In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...

متن کامل

Certain Facts about Families of Subsets of Many Sorted Sets

For simplicity, we follow the rules: I, G, H, i are sets, A, B, M are many sorted sets indexed by I, s1, s2, s3 are families of subsets of I, v, w are subsets of I, and F is a many sorted function indexed by I. The scheme MSFExFunc deals with a set A , many sorted sets B, C indexed by A , and a ternary predicate P , and states that: There exists a many sorted function F from B into C such that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences

سال: 2023

ISSN: ['1526-1492', '1526-1506']

DOI: https://doi.org/10.32604/cmes.2023.022819